Optimizing operational costs and service quality in dial-a-ride systems
نویسندگان
چکیده
منابع مشابه
Quality of service in dial-a-ride operations
Few studies have been conducted on the quality of service provided by the organizations responsible of providing dial-a-ride services for people with reduced mobility. In order to study quality in such contexts, the paper first defines what is meant by “quality” in the service sector. The difference between quality and satisfaction is then discussed, and the most well-known scales of measuremen...
متن کاملIs Dial-a-Ride Bus Reasonable in Large Scale Towns? Evaluation of Usability of Dial-a-Ride Systems by Simulation
Dial-a-ride systems are focused as a style of new transportation systems for urban area. While it is reported that such systems improve usability of bus systems when it is applied in a small town/area, it is not obvious how and when the system are reasonable compared with traditional fixed-route bus systems. We conducted a couple of computer simulations of dial-a-ride and fixed-route systems to...
متن کاملRevenue Maximization in Online Dial-A-Ride
We study a variation of the Online-Dial-a-Ride Problem where each request comes with not only a source, destination and release time, but also has an associated revenue. The server’s goal is to maximize its total revenue within a given time limit, T . We show that the competitive ratio is unbounded for any deterministic online algorithm for the problem. We then provide a 3-competitive algorithm...
متن کاملThe Dial-A-Ride Problem with Transfers
The Dial–A–Ride Problem with Transfers (DARPT) consists in defining a set of routes that satisfy transportation requests of users between a set of pickup points and a set of delivery points, in the presence of ride time constraints. Users may change vehicles during their trip. This change of vehicle, called a transfer, is made at specific locations called transfer points. Solving the DARPT invo...
متن کاملMaximizing Revenues for Online-Dial-a-Ride
In the classic Dial-a-Ride Problem, a server travels in some metric space to serve requests for rides. Each request has a source, destination, and release time. We study a variation of this problem where each request also has a revenue that is earned if the request is satisfied. The goal is to serve requests within a time limit such that the total revenue is maximized. We first prove that the v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2017
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-017-0351-5